Group Divisible Designs with Two Associate Classes and λ2=1

نویسندگان

  • Nittiya Pabhapote
  • Narong Punnim
چکیده

A pairwise balanced design is an ordered pair S,B , denoted PBD S,B , where S is a finite set of symbols, and B is a collection of subsets of S called blocks, such that each pair of distinct elements of S occurs together in exactly one block of B. Here |S| v is called the order of the PBD. Note that there is no condition on the size of the blocks in B. If all blocks are of the same size k, then we have a Steiner system S v, k . A PBD with index λ can be defined similarly; each pair of distinct elements occurs in λ blocks. If all blocks are same size, say k, then we get a balanced incomplete block design BIBD v, b, r, k, λ . In other words, a BIBD v, b, r, k, λ is a set S of v elements together with a collection of b k-subsets of S, called blocks, where each point occurs in r blocks, and each pair of distinct elements occurs in exactly λ blocks see 1–3 . Note that in a BIBD v, b, r, k, λ , the parameters must satisfy the necessary conditions

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Group Divisible Designs with Two Associate Classes and with Two Unequal Groups

A group divisible design GDD(m,n; 3, λ1, λ2) is an ordered triple (V,G,B), where V is a m+ n-set of symbols, G is a partition of V into 2 sets of sizes m,n, each set being called group, and B is a collection of 3-subsets (called blocks) of V , such that each pair of symbols from the same group occurs in exactly λ1 blocks; and each pair of symbols from different groups occurs in exactly λ2 block...

متن کامل

Group divisible designs GDD(n, n, n, 1; λ1, λ2)

We give a complete solution for the existence problem of group divisible designs (or PBIBDs) with blocks of size k = 3, four groups of size (n, n, n, 1), and any two indices (λ1, λ2). Moreover, we introduce a construction of infinitely many group divisible designs with t groups of size n and one group of size 1. The construction technique utilizes our main result, together with some other known...

متن کامل

C4-factorizations with two associate classes, λ1 is odd

Let K = K(a, p;λ1, λ2) be the multigraph with: the number of vertices in each part equal to a; the number of parts equal to p; the number of edges joining any two vertices of the same part equal to λ1; and the number of edges joining any two vertices of different parts equal to λ2. This graph was of interest to Bose and Shimamoto in their study of group divisible designs with two associate clas...

متن کامل

C4-factorizations with two associate classes

C. A. Rodger, M. A. Tiemeyer∗, Auburn University Let K = K(a, p;λ1, λ2) be the multigraph with: the number of vertices in each part equal to a; the number of parts equal to p; the number of edges joining any two vertices of the same part equal to λ1; and the number of edges joining any two vertices of different parts equal to λ2. This graph was of interest to Bose and Shimamoto in their study o...

متن کامل

GDDs with two associate classes and with three groups of sizes 1, n and n

A group divisible design GDD(5, n, n; 3, λ1, λ2) is an ordered triple (V,G,B), where V is a 5 + n + n-set of symbols, G is a partition of V into 3 sets of sizes 5, n, n, each set being called group, and B is a collection of 3-subsets (called blocks) of V , such that each pair of symbols from the same group occurs in exactly λ1 blocks; and each pair of symbols from different groups occurs in exa...

متن کامل

Two classes of q-ary codes based on group divisible association schemes

By means of Hall's Marriage Theorem, a class of q-ary codes are obtained through block designs based on group divisible association schemes with two associate classes. If these block designs are further semiframes, another class of q-ary codes are also constructed. @ 1999 Elsevier Science B.V. All rights reserved

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Math. Mathematical Sciences

دوره 2011  شماره 

صفحات  -

تاریخ انتشار 2011